ON SOME PARTITIONS WHERE EVEN PARTS DO NOT REPEAT

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic properties of partitions with even parts distinct

In this work, we consider the function ped(n), the number of partitions of an integer n wherein the even parts are distinct (and the odd parts are unrestricted). Our goal is to consider this function from an arithmetical point of view in the spirit of Ramanujan’s congruences for the unrestricted partition function p(n). We prove a number of results for ped(n) including the following: For all n≥...

متن کامل

New Congruences for Partitions where the Odd Parts are Distinct

Let pod(n) denote the number of partitions of n wherein odd parts are distinct (and even parts are unrestricted). We find some new interesting congruences for pod(n) modulo 3, 5 and 9.

متن کامل

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

A note on partitions into distinct parts and odd parts

Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...

متن کامل

Even Partitions in Plethysms

We prove that for all natural numbers k, n, d with k ≤ d and every partition λ of size kn with at most k parts there exists an irreducible GLd(C)-representation of highest weight 2λ in the plethysm Sym(SymC). This gives an affirmative answer to a conjecture by Weintraub (J. Algebra, 129 (1): 103-114, 1990). Our investigation is motivated by questions of geometric complexity theory and uses idea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Demonstratio Mathematica

سال: 2009

ISSN: 2391-4661

DOI: 10.1515/dema-2009-0205